A randomized progressive hedging algorithm for stochastic variational inequality

نویسندگان

چکیده

Recently, stochastic variational inequality (SVI) has been extended from single stage to multistage by Rockafellar and Wets (Math. Program., 165:331-360, 2017) progressive hedging algorithm (PHA) also programming linear complementarity SVI Sun 174:453-471, 2019). However, the per-iteration cost of PHA can be prohibitively high when scenario set is large, despite decomposition parallelizable nature algorithm. To address this issue, we propose a randomized that allows us control randomly selecting small subset scenarios updating only corresponding variable components while freezing variables unselected at current iteration. By measuring quality an approximate solution using restricted merit function, demonstrate significant reduction in cost, converges expectation ergodic sense same sublinear rate as original PHA.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Algorithm for Stochastic Variational Inequality with an Application

Recently stochastic variational inequality has been extensively studied. However there are few methods can be effectively realized. This study considers to solve stochastic variational inequality by combining quasi-Monte Carlo approach and interior point method. The global convergence is established for the new algorithm. An application for the synergies analysis of the supply chain after M&A f...

متن کامل

A Progressive Hedging Based Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Progressive Hedging (PH) is a well-known algorithm for solving multi-stage stochastic convex optimization problems. Most previous extensions of PH for stochastic mixed-integer programs have been implemented without convergence guarantees. In this paper, we present a new framework that shows how PH can be utilized while guaranteeing convergence to globally optimal solutions of stochastic mixed-i...

متن کامل

Sampling based progressive hedging algorithms for stochastic programming problems

...............................................................................................138 Autobiographical Statement ................................................................................ 140

متن کامل

Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

We present a method for computing lower bounds in the Progressive Hedging Algorithm (PHA) for two-stage and multi-stage stochastic mixedinteger programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated durin...

متن کامل

Progressive hedging-based metaheuristics for stochastic network design

We consider the stochastic variant of the fixed-charge capacitated multicommodity network design (CMND) problem in which demands are stochastic. We propose a two-stage stochastic programming formulation where design decisions make up the first stage, while a series of recourse decisions are made in the second stage to distribute the commodities according to observed demands. The overall objecti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2023

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2023118